Distance Magic Labeling and Two Products of Graphs
نویسندگان
چکیده
منابع مشابه
Distance Magic Labeling and Two Products of Graphs
Let G = (V,E) be a graph of order n. A distance magic labeling of G is a bijection l : V → {1, . . . , n} for which there exists a positive integer k such that ∑ x∈N(v) l(x) = k for all v ∈ V , where N(v) is the neighborhood of v. We introduce a natural subclass of distance magic graphs. For this class we show that it is closed for the direct product with regular graphs and closed as a second f...
متن کاملTotally magic cordial labeling of some graphs
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f(a) + f(b) + f(ab) ≡ C (mod 2) for all ab ∈ E(G) and |nf (0) − nf (1)| ≤ 1, where nf (i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we give a necessary condition for an odd graph to be not totally magic cordial and ...
متن کاملDistance Two Vertex-Magic Graphs
Given an abelian group A, a graph G = (V, E) is said to have a distance two magic labeling in A if there exists a labeling l : E(G) → A − {0} such that the induced vertex labeling l∗ : V (G) → A defined by l∗(v) = ∑ e∈E(v) l(e) is a constant map, where E(v) = {e ∈ E(G) : d(v, e) < 2}. The set of all h ∈ Z+ for which G has a distance two magic labeling in Zh is called the distance two magic spec...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملGroup distance magic labeling of some cycle-related graphs
Let G = (V,E) be a graph and Γ an abelian group, both of order n. A group distance magic labeling of G is a bijection : V → Γ for which there exists μ ∈ Γ such that ∑x∈N(v) (x) = μ for all v ∈ V, where N(v) is the neighborhood of v. Froncek [Australas. J. Combin. 55 (2013), 167–174] showed that the cartesian product Cm Cn, m,n ≥ 3 is a Zmn-distance magic graph if and only if mn is even. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2014
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-014-1455-8